Solving Multiobjective Time Tabling Problem by Using Requests
نویسندگان
چکیده
منابع مشابه
Solving a Time Tabling Problem by Constraint Satisfaction
The time tabling problem is well known and much research has been done about it. This paper shows how a difficult instance of the time tabling problem with many parameters and loose constraints can be handled using constraint satisfaction. To this end the constraints have to be modeled in a format that can be handled efficiently. It is shown how several modelling problems can be solved in a gen...
متن کاملSolving a Real-life Time Tabling and Transportation Problem
Many real-life problems in the domain of resource allocation and scheduling require Solutions which are composed of several approaches or techniques. Often, complex problems are divided into sub-problems, subproblems are solved by separate people (agents), who may use different techniques and expertise for solving them, and the sub-problems are combined later to yield a coherent, consistent sol...
متن کاملSolving Multiobjective Optimization Problem by Constraint Optimization
Multiobjective optimization problems (MOPs) have attracted intensive efforts from AI community and many multiobjective evolutionary algorithms (MOEAs) were proposed to tackle MOPs. In addition, a few researchers exploited MOEAs to solve constraint optimization problems (COPs). In this paper, we investigate how to tackle a MOP by iteratively solving a series of COPs and propose the algorithm nam...
متن کاملMultiobjective controller design by solving a multiobjective matrix inequality problem
In this study, linear matrix inequality (LMI) approaches and multiobjective (MO) evolutionary algorithms are integrated to design controllers. An MO matrix inequality problem (MOMIP) is first defined. A hybrid MO differential evolution (HMODE) algorithm is then developed to solve the MOMIP. The hybrid algorithm combines deterministic and stochastic searching schemes. In the solving process, the...
متن کاملSolving Real-Life Time-Tabling Problems
We will compare the performance of a Genetic Algorithm and Simulated Annealing on instances of difficult real-life Time-Tabling Problems. We will further explain how the performance can be increased significantly by applying a general and very effective genotype-to-phenotype decoding. Furthermore, we will contrast the performance of Lamarckian Learning to the performance of Baldwin Learning. Fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 1999
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.12.90